Deepest Leaves Sum (Easy DFS) | LeetCode 1302 | Cracking the Coding Interview

[6.1] Graph Data Structure in Java

[5.2] Queues in Java using Linked List

[5.1] Queues Implementation in Java using Array

[4.1] Stacks in Java

Deepest Leaves Sum (Easy DFS) | LeetCode 1302 | Cracking the Coding Interview

[3.3] Deletion in Linked List in Java

Swap Nodes in Pairs - Facebook Interview Question - LeetCode 24

Builder Design Pattern in Object Oriented Design

[3.2] Insert Node at specific position in Linked List

Abstract Factory Design Pattern | Object Oriented Design

[8.1] Bellman Ford Shortest Path: Detect Negative Cycles

Reverse Linked List(Iterative) | Leetcode 206 | Whiteboard Approach | Cracking the Coding Interview

Factory Design Pattern | Object Oriented Design

UML Class Diagrams Full Course (Unified Modeling Language) | Object Oriented Design Coding Interview

Dependency Inversion Principle in Object Oriented Design | SOLID Principle

Interface Segregation Principle in Object Oriented Design | SOLID Principles

Liskov Substitution Principle in Object Oriented Design | SOLID Principles

Open Closed Principle in Object Oriented Design | SOLID Principles

Single Responsibility Principle in Object Oriented Design

Object Oriented Design LLD Roadmap 🔥 | New Course

[3.1] Insert Node at Head in Linked List (Java)

[3.0] Linked List in Java

[2.2] Rotate Array in Java

[2.0] Arrays in Java